home *** CD-ROM | disk | FTP | other *** search
/ Aminet 41 / Aminet 41 (2001)(Schatztruhe)[!][Feb 2001].iso / Aminet / dev / c / libmpeg_src.lha / util.h < prev    next >
Encoding:
C/C++ Source or Header  |  1995-07-19  |  21.0 KB  |  359 lines
  1. /*
  2.  * Copyright (c) 1992 The Regents of the University of California.
  3.  * All rights reserved.
  4.  * 
  5.  * Permission to use, copy, modify, and distribute this software and its
  6.  * documentation for any purpose, without fee, and without written agreement is
  7.  * hereby granted, provided that the above copyright notice and the following
  8.  * two paragraphs appear in all copies of this software.
  9.  * 
  10.  * IN NO EVENT SHALL THE UNIVERSITY OF CALIFORNIA BE LIABLE TO ANY PARTY FOR
  11.  * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT
  12.  * OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE UNIVERSITY OF
  13.  * CALIFORNIA HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  14.  * 
  15.  * THE UNIVERSITY OF CALIFORNIA SPECIFICALLY DISCLAIMS ANY WARRANTIES,
  16.  * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
  17.  * AND FITNESS FOR A PARTICULAR PURPOSE.  THE SOFTWARE PROVIDED HEREUNDER IS
  18.  * ON AN "AS IS" BASIS, AND THE UNIVERSITY OF CALIFORNIA HAS NO OBLIGATION TO
  19.  * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
  20.  */
  21.  
  22. /* Status codes for bit stream i/o operations. */
  23.  
  24. #define NO_VID_STREAM -1
  25. #define UNDERFLOW -2
  26. #define OK 1
  27.  
  28. /* Size increment of extension data buffers. */
  29.  
  30. #define EXT_BUF_SIZE 1024
  31.  
  32. /* External declarations for bitstream i/o operations. */
  33. extern unsigned int bitMask[];
  34. extern unsigned int nBitMask[];
  35. extern unsigned int rBitMask[];
  36. extern unsigned int bitTest[];
  37.  
  38. /* External declarations of bitstream global variables. */
  39. extern unsigned int curBits;
  40. extern int bitOffset;
  41. extern int bufLength;
  42. extern unsigned int *bitBuffer;
  43.  
  44. /* Macro for updating bit counter if analysis tool is on. */
  45. #define UPDATE_COUNT(numbits)
  46.  
  47. #ifdef NO_SANITY_CHECKS
  48. #define get_bits1(result)                                                 \
  49. {                                                                         \
  50.   UPDATE_COUNT(1);                                                        \
  51.   result = ((curBits & 0x80000000) != 0);                              \
  52.   curBits <<= 1;                                                          \
  53.   bitOffset++;                                                            \
  54.                                                                           \
  55.   if (bitOffset & 0x20) {                                                 \
  56.     bitOffset = 0;                                                        \
  57.     bitBuffer++;                                                          \
  58.     curBits = *bitBuffer;                                                 \
  59.     bufLength--;                                                          \
  60.   }                                                                       \
  61. }
  62.  
  63. #define get_bits2(result)                                                 \
  64. {                                                                         \
  65.   UPDATE_COUNT(2);                                                        \
  66.   bitOffset += 2;                                                         \
  67.                                                                           \
  68.   if (bitOffset & 0x20) {                                                 \
  69.     bitOffset -= 32;                                                      \
  70.     bitBuffer++;                                                          \
  71.     bufLength--;                                                          \
  72.     if (bitOffset) {                                                      \
  73.       curBits |= (*bitBuffer >> (2 - bitOffset));                         \
  74.     }                                                                     \
  75.     result = ((curBits & 0xc0000000) >> 30);                           \
  76.     curBits = *bitBuffer << bitOffset;                                    \
  77.   }                                                                       \
  78.                                                                           \
  79.   result = ((curBits & 0xc0000000) >> 30);                             \
  80.   curBits <<= 2;                                                          \
  81. }
  82.  
  83. #define get_bitsX(num, mask, shift,  result)                              \
  84. {                                                                         \
  85.   UPDATE_COUNT(num);                                                      \
  86.   bitOffset += num;                                                       \
  87.                                                                           \
  88.   if (bitOffset & 0x20) {                                                 \
  89.     bitOffset -= 32;                                                      \
  90.     bitBuffer++;                                                          \
  91.     bufLength--;                                                          \
  92.     if (bitOffset) {                                                      \
  93.       curBits |= (*bitBuffer >> (num - bitOffset));                       \
  94.     }                                                                     \
  95.     result = ((curBits & mask) >> shift);                              \
  96.     curBits = *bitBuffer << bitOffset;                                    \
  97.   }                                                                       \
  98.   else {                                                                  \
  99.     result = ((curBits & mask) >> shift);                              \
  100.     curBits <<= num;                                                      \
  101.   }                                                                       \
  102. }
  103. #else
  104.  
  105. #define get_bits1(result)                                                 \
  106. {                                                                         \
  107.   /* Check for underflow. */                                              \
  108.                                                                           \
  109.   if (bufLength < 2) {                                                    \
  110.     correct_underflow();                                                  \
  111.   }                                                                       \
  112.   UPDATE_COUNT(1);                                                        \
  113.   result = ((curBits & 0x80000000) != 0);                              \
  114.   curBits <<= 1;                                                          \
  115.   bitOffset++;                                                            \
  116.                                                                           \
  117.   if (bitOffset & 0x20) {                                                 \
  118.     bitOffset = 0;                                                        \
  119.     bitBuffer++;                                                          \
  120.     curBits = *bitBuffer;                                                 \
  121.     bufLength--;                                                          \
  122.   }                                                                       \
  123. }
  124.  
  125. #define get_bits2(result)                                                 \
  126. {                                                                         \
  127.   /* Check for underflow. */                                              \
  128.                                                                           \
  129.   if (bufLength < 2) {                                                    \
  130.     correct_underflow();                                                  \
  131.   }                                                                       \
  132.   UPDATE_COUNT(2);                                                        \
  133.   bitOffset += 2;                                                         \
  134.                                                                           \
  135.   if (bitOffset & 0x20) {                                                 \
  136.     bitOffset -= 32;                                                      \
  137.     bitBuffer++;                                                          \
  138.     bufLength--;                                                          \
  139.     if (bitOffset) {                                                      \
  140.       curBits |= (*bitBuffer >> (2 - bitOffset));                         \
  141.     }                                                                     \
  142.     result = ((curBits & 0xc0000000) >> 30);                           \
  143.     curBits = *bitBuffer << bitOffset;                                    \
  144.   }                                                                       \
  145.                                                                           \
  146.   result = ((curBits & 0xc0000000) >> 30);                             \
  147.   curBits <<= 2;                                                          \
  148. }
  149.  
  150. #define get_bitsX(num, mask, shift,  result)                              \
  151. {                                                                         \
  152.   /* Check for underflow. */                                              \
  153.                                                                           \
  154.   if (bufLength < 2) {                                                    \
  155.     correct_underflow();                                                  \
  156.   }                                                                       \
  157.   UPDATE_COUNT(num);                                                      \
  158.   bitOffset += num;                                                       \
  159.                                                                           \
  160.   if (bitOffset & 0x20) {                                                 \
  161.     bitOffset -= 32;                                                      \
  162.     bitBuffer++;                                                          \
  163.     bufLength--;                                                          \
  164.     if (bitOffset) {                                                      \
  165.       curBits |= (*bitBuffer >> (num - bitOffset));                       \
  166.     }                                                                     \
  167.     result = ((curBits & mask) >> shift);                              \
  168.     curBits = *bitBuffer << bitOffset;                                    \
  169.   }                                                                       \
  170.   else {                                                                  \
  171.    result = ((curBits & mask) >> shift);                               \
  172.    curBits <<= num;                                                       \
  173.   }                                                                       \
  174. }
  175. #endif
  176.  
  177. #define get_bits3(result) get_bitsX(3,   0xe0000000, 29, result)
  178. #define get_bits4(result) get_bitsX(4,   0xf0000000, 28, result)
  179. #define get_bits5(result) get_bitsX(5,   0xf8000000, 27, result)
  180. #define get_bits6(result) get_bitsX(6,   0xfc000000, 26, result)
  181. #define get_bits7(result) get_bitsX(7,   0xfe000000, 25, result)
  182. #define get_bits8(result) get_bitsX(8,   0xff000000, 24, result)
  183. #define get_bits9(result) get_bitsX(9,   0xff800000, 23, result)
  184. #define get_bits10(result) get_bitsX(10, 0xffc00000, 22, result)
  185. #define get_bits11(result) get_bitsX(11, 0xffe00000, 21, result)
  186. #define get_bits12(result) get_bitsX(12, 0xfff00000, 20, result)
  187. #define get_bits14(result) get_bitsX(14, 0xfffc0000, 18, result)
  188. #define get_bits16(result) get_bitsX(16, 0xffff0000, 16, result)
  189. #define get_bits18(result) get_bitsX(18, 0xffffc000, 14, result)
  190. #define get_bits32(result) get_bitsX(32, 0xffffffff,  0, result)
  191.  
  192. #define get_bitsn(num, result) get_bitsX((num), nBitMask[num], (32-(num)), result)
  193.  
  194. #ifdef NO_SANITY_CHECKS
  195. #define show_bits32(result)                                      \
  196. {                                                                       \
  197.   if (bitOffset) {                            \
  198.     result = curBits | (*(bitBuffer+1) >> (32 - bitOffset));        \
  199.   }                                                                     \
  200.   else {                                                                \
  201.     result = curBits;                            \
  202.   }                                                                     \
  203. }
  204.  
  205. #define show_bitsX(num, mask, shift,  result)                           \
  206. {                                                                       \
  207.   int bO;                                                               \
  208.   bO = bitOffset + num;                                                 \
  209.   if (bO > 32) {                                                        \
  210.     bO -= 32;                                                           \
  211.     result = ((curBits & mask) >> shift) |                              \
  212.                 (*(bitBuffer+1) >> (shift + (num - bO)));               \
  213.   }                                                                     \
  214.   else {                                                                \
  215.     result = ((curBits & mask) >> shift);                               \
  216.   }                                                                     \
  217. }
  218.  
  219. #else
  220. #define show_bits32(result)                                       \
  221. {                                                                       \
  222.   /* Check for underflow. */                                            \
  223.   if (bufLength < 2) {                                                  \
  224.     correct_underflow();                                                \
  225.   }                                                                     \
  226.   if (bitOffset) {                            \
  227.     result = curBits | (*(bitBuffer+1) >> (32 - bitOffset));        \
  228.   }                                                                     \
  229.   else {                                                                \
  230.     result = curBits;                            \
  231.   }                                                                     \
  232. }
  233.  
  234. #define show_bitsX(num, mask, shift, result)                            \
  235. {                                                                       \
  236.   int bO;                                                               \
  237.                                                                         \
  238.   /* Check for underflow. */                                            \
  239.   if (bufLength < 2) {                                                  \
  240.     correct_underflow();                                                \
  241.   }                                                                     \
  242.   bO = bitOffset + num;                                                 \
  243.   if (bO > 32) {                                                        \
  244.     bO -= 32;                                                           \
  245.     result = ((curBits & mask) >> shift) |                              \
  246.                 (*(bitBuffer+1) >> (shift + (num - bO)));               \
  247.   }                                                                     \
  248.   else {                                                                \
  249.     result = ((curBits & mask) >> shift);                               \
  250.   }                                                                     \
  251. }
  252. #endif
  253.  
  254. #define show_bits1(result)  show_bitsX(1,  0x80000000, 31, result)
  255. #define show_bits2(result)  show_bitsX(2,  0xc0000000, 30, result)
  256. #define show_bits3(result)  show_bitsX(3,  0xe0000000, 29, result)
  257. #define show_bits4(result)  show_bitsX(4,  0xf0000000, 28, result)
  258. #define show_bits5(result)  show_bitsX(5,  0xf8000000, 27, result)
  259. #define show_bits6(result)  show_bitsX(6,  0xfc000000, 26, result)
  260. #define show_bits7(result)  show_bitsX(7,  0xfe000000, 25, result)
  261. #define show_bits8(result)  show_bitsX(8,  0xff000000, 24, result)
  262. #define show_bits9(result)  show_bitsX(9,  0xff800000, 23, result)
  263. #define show_bits10(result) show_bitsX(10, 0xffc00000, 22, result)
  264. #define show_bits11(result) show_bitsX(11, 0xffe00000, 21, result)
  265. #define show_bits12(result) show_bitsX(12, 0xfff00000, 20, result)
  266. #define show_bits13(result) show_bitsX(13, 0xfff80000, 19, result)
  267. #define show_bits14(result) show_bitsX(14, 0xfffc0000, 18, result)
  268. #define show_bits15(result) show_bitsX(15, 0xfffe0000, 17, result)
  269. #define show_bits16(result) show_bitsX(16, 0xffff0000, 16, result)
  270. #define show_bits17(result) show_bitsX(17, 0xffff8000, 15, result)
  271. #define show_bits18(result) show_bitsX(18, 0xffffc000, 14, result)
  272. #define show_bits19(result) show_bitsX(19, 0xffffe000, 13, result)
  273. #define show_bits20(result) show_bitsX(20, 0xfffff000, 12, result)
  274. #define show_bits21(result) show_bitsX(21, 0xfffff800, 11, result)
  275. #define show_bits22(result) show_bitsX(22, 0xfffffc00, 10, result)
  276. #define show_bits23(result) show_bitsX(23, 0xfffffe00,  9, result)
  277. #define show_bits24(result) show_bitsX(24, 0xffffff00,  8, result)
  278. #define show_bits25(result) show_bitsX(25, 0xffffff80,  7, result)
  279. #define show_bits26(result) show_bitsX(26, 0xffffffc0,  6, result)
  280. #define show_bits27(result) show_bitsX(27, 0xffffffe0,  5, result)
  281. #define show_bits28(result) show_bitsX(28, 0xfffffff0,  4, result)
  282. #define show_bits29(result) show_bitsX(29, 0xfffffff8,  3, result)
  283. #define show_bits30(result) show_bitsX(30, 0xfffffffc,  2, result)
  284. #define show_bits31(result) show_bitsX(31, 0xfffffffe,  1, result)
  285.  
  286. #define show_bitsn(num,result) show_bitsX((num), (0xffffffff << (32-(num))), (32-(num)), result)
  287.  
  288. #ifdef NO_SANITY_CHECKS
  289. #define flush_bits32                                                  \
  290. {                                                                     \
  291.   UPDATE_COUNT(32);                                                   \
  292.                                                                       \
  293.   bitBuffer++;                                                        \
  294.   bufLength--;                                                        \
  295.   curBits = *bitBuffer  << bitOffset;                                 \
  296. }
  297.  
  298. #define flush_bits(num)                                               \
  299. {                                                                     \
  300.   bitOffset += num;                                                   \
  301.                                                                       \
  302.   UPDATE_COUNT(num);                                                  \
  303.                                                                       \
  304.   if (bitOffset & 0x20) {                                             \
  305.     bitOffset -= 32;                                                  \
  306.     bitBuffer++;                                                      \
  307.     bufLength--;                                                      \
  308.     curBits = *bitBuffer  << bitOffset;                               \
  309.   }                                                                   \
  310.   else {                                                              \
  311.     curBits <<= num;                                                  \
  312.   }                                                                   \
  313. }
  314. #else
  315. #define flush_bits32                                                  \
  316. {                                                                     \
  317.   if (curVidStream == NULL) {                                         \
  318.     /* Deal with no vid stream here. */                               \
  319.   }                                                                   \
  320.                                                                       \
  321.   if (bufLength < 2) {                                                \
  322.     correct_underflow();                                              \
  323.   }                                                                   \
  324.                                                                       \
  325.   UPDATE_COUNT(32);                                                   \
  326.                                                                       \
  327.   bitBuffer++;                                                        \
  328.   bufLength--;                                                        \
  329.   curBits = *bitBuffer  << bitOffset;                                 \
  330. }
  331.  
  332. #define flush_bits(num)                                               \
  333. {                                                                     \
  334.   if (curVidStream == NULL) {                                         \
  335.     /* Deal with no vid stream here. */                               \
  336.   }                                                                   \
  337.                                                                       \
  338.   if (bufLength < 2) {                                                \
  339.     correct_underflow();                                              \
  340.   }                                                                   \
  341.                                                                       \
  342.   UPDATE_COUNT(num);                                                  \
  343.                                                                       \
  344.   bitOffset += num;                                                   \
  345.                                                                       \
  346.   if (bitOffset & 0x20) {                                             \
  347.     bufLength--;                                                      \
  348.     bitOffset -= 32;                                                  \
  349.     bitBuffer++;                                                      \
  350.     curBits = *bitBuffer << bitOffset;                                \
  351.   }                                                                   \
  352.   else {                                                              \
  353.     curBits <<= num;                                                  \
  354.   }                                                                   \
  355. }
  356. #endif
  357.  
  358. #define UTIL2
  359.